Second-order Quantile Methods for Experts and Combinatorial Games Wouter M. Koolen Tim van Erven

Source URL: wouterkoolen.info

• Electronics
• Noise
• Quantitative analyst
• Best
• worst and average case
• Complexity

AVERAGE-CASE VS GENERIC-CASE COMPLEXITY OF LATTICE PROBLEMS Antonio R. Nicolosi∗ Computer Science Department Stevens Institute of Technology e-mail:

Source URL: www.cs.stevens.edu

How to Catch L2 -Heavy-Hitters on Sliding Windows Vladimir Braverman1, Ran Gelles2 , and Rafail Ostrovsky3 1 Department of Computer Science, Johns Hopkins University, . Department of Computer Science, Univ

Source URL: arxiv.org

• Theory of computation
• Circuit complexity
• NC
• Best
• worst and average case
• Ogonek
• Theoretical computer science

Notions of Average-Case Complexity for Random 3-SAT Albert Atserias Universitat Polit`ecnica de Catalunya, Barcelona, Spain Abstract. By viewing random 3-SAT as a distributional problem, we go over some of the notions of

Source URL: www.cs.upc.edu

Project Summary The design and analysis of network algorithmics solutions is a rich area of research that has led to numerous successful deployments in commercial Internet routers and network monitoring appliances. In ge

Source URL: www.cc.gatech.edu

• Computational complexity theory
• Cybernetics
• Formal sciences
• Computer science
• Best
• worst and average case
• Stochastic
• Algorithm
• Control theory
• Applied mathematics
• Mathematics
• Analysis of algorithms

Dynamics of Algorithmic Processing in Computer Systems

Source URL: www.complex-systems.com

• Analysis of algorithms
• Computational complexity theory
• Sorting algorithms
• Algorithm
• Complexity
• Best
• worst and average case
• Insertion sort
• Worst-case complexity
• Distributed computing
• Theoretical computer science
• Applied mathematics
• Mathematics

On the Theory of Average Case Complexity  Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx

Source URL: www.wisdom.weizmann.ac.il

• Complexity classes
• Computability theory
• Mathematical optimization
• Structural complexity theory
• P versus NP problem
• NP-complete
• Turing reduction
• Decision problem
• Reduction
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook Department of Computer Science University of Toronto Toronto, Canada {yuvalf, toni, robere, sacoo

Source URL: www.cs.toronto.edu

• Order theory
• Computational complexity theory
• Functional analysis
• Monotonic function
• Real analysis
• Circuit complexity
• FO
• Aanderaa–Karp–Rosenberg conjecture
• Galois connection
• Theoretical computer science
• Mathematics
• Mathematical analysis

Computational Complexity Fifteenth Annual IEEE Conference ADVANCE REGISTRATION FORM

Source URL: computationalcomplexity.org

• ACM SIGACT
• Lance Fortnow
• Average-case complexity
• Russell Impagliazzo
• Decision tree model
• Quantum information science
• Computer science
• Richard Cleve
• Complexity
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus∗∗ Toniann Pitassi∗† Robert Robere∗‡

Source URL: www.cs.toronto.edu

• Order theory
• Computational complexity theory
• Functional analysis
• Monotonic function
• Real analysis
• Circuit complexity
• Aanderaa–Karp–Rosenberg conjecture
• Clique problem
• Mathematics
• Mathematical analysis
• Theoretical computer science